|
In computability theory, a function is called limit computable if it is the limit of a uniformly computable sequence of functions. The terms computable in the limit and limit recursive are also used. One can think of limit computable functions as those admitting an eventually correct computable guessing procedure at their true value. A set is limit computable just when its characteristic function is limit computable. If the sequence is uniformly computable relative to ''D'', then the function is limit computable in ''D''. == Formal definition == A total function is limit computable if there is a total computable function such that : The total function is limit computable in ''D'' if there is a total function computable in ''D'' also satisfying : A set of natural numbers is defined to be computable in the limit if and only if its characteristic function is computable in the limit. In contrast, the set is computable if and only if it is computable in the limit by a function and there is a second computable function that takes input ''i'' and returns a value of ''t'' large enough the has stabilized. 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Computation in the limit」の詳細全文を読む スポンサード リンク
|